Limited approximation of numerical range of normal matrix

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limited Approximation of Numerical Range of Normal Matrix

Let A be an n× n normal matrix, whose numerical range NR[A] is a k -polygon. If a unit vector v ∈ W ⊆ Cn, with dimW = k and the point v∗Av ∈ IntNR[A], then NR[A] is circumscribed to NR[P∗AP], where P is an n× (k− 1) isometry of {span{v}}⊥ W → Cn, [1]. In this paper, we investigate an internal approximation of NR[A] by an increasing sequence of NR[Cs] of compressed matrices Cs = R∗s ARs, with R∗...

متن کامل

Numerical approximation of the boundary of numerical range of matrix polynomials

The numerical range of an n×n matrix polynomial P (λ) = Amλ + Am−1λm−1 + · · ·+ A1λ + A0 is defined by W (P ) = {λ ∈ C : x∗P (λ)x = 0, x ∈ C, x∗x = 1}, and plays an important role in the study of matrix polynomials. In this paper, we describe a methodology for the illustration of its boundary, ∂W (P ), using recent theoretical results on numerical ranges and algebraic curves.

متن کامل

The numerical range of a nonnegative matrix

We offer an almost self-contained development of Perron–Frobenius type results for the numerical range of an (irreducible) nonnegative matrix, rederiving and completing the previous work of Issos, Nylen and Tam, and Tam and Yang on this topic. We solve the open problem of characterizing nonnegative matrices whose numerical ranges are regular convex polygons with center at the origin. Some relat...

متن کامل

Numerical Experiments with Toeplitz Matrix Approximation Methods

Positive semidefinite Toeplitz matrix constraints arise naturally in a variety of problems in engineering. This paper deals with the numerical of this problem. Our approach is based on (i) interior point primal-dual path-following method; (ii) a projection algorithm which converges globally but slowly; (iii) the filterSQP method which is faster. Hybrid methods that attempt to combine the best f...

متن کامل

On the decomposable numerical range of operators

 ‎Let $V$ be an $n$-dimensional complex inner product space‎. ‎Suppose‎ ‎$H$ is a subgroup of the symmetric group of degree $m$‎, ‎and‎ ‎$chi‎ :‎Hrightarrow mathbb{C} $ is an irreducible character (not‎ ‎necessarily linear)‎. ‎Denote by $V_{chi}(H)$ the symmetry class‎ ‎of tensors associated with $H$ and $chi$‎. ‎Let $K(T)in‎ (V_{chi}(H))$ be the operator induced by $Tin‎ ‎text{End}(V)$‎. ‎Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operators and Matrices

سال: 2010

ISSN: 1846-3886

DOI: 10.7153/oam-04-07